A soft decision decoding of product BCH and Reed-Müller codes
نویسندگان
چکیده
Orthogonal Frequency Division Multiplexing (OFDM) is a very attractive modulation scheme for data transmission in multipath channels. But the high Peak-to-MEan Power Ratio (PMEPR) of the modulated signal is a major drawback and makes the use of some circuits very tricky : for instance, power amplifiers at the emission side could have nonlinear characteristics and a high PMEPR could exhibits intermodulation noise and distortions. A very recent theory based on Reed-Müller codes controls the PMEPR and exploits the correction capacity of the code to correct error propagation : the PMEPR is reduced to a level of 3 dB and the distance of the code is the quarter of the codeword (in this specific application of Reed-Müller and OFDM). But the correction capacity is limited and have to be balanced with the code rate. This paper first presents a product coding scheme based on BCH and Reed-Müller codes to improve error correction and to keep the PMEPR propriety of the modulated signal. Next, we present a soft decision decoding based on Chase’s algorithm associated to Reed-Müller codes. Then, we analyse the BER performances of both hard and soft decoding associated to the product coding scheme modelling AWGN and nonlinear TWTA power amplifiers. With this soft decision decoding, we obtain a 1.5 dB coding gain compared to hard decoding when using product codes and about 5 dB coding gain compared to an uncoded system, at BER=10. Balanced with the global code rate, BCH(255,231,7) with Reed-Müller codes have higher coding gain compared to other product codes. Nonlinear distortions degrade BER performances and the coding gain is still about 2 dB at BER=10. The applications concerns high data rate and broadband transmissions using OFDM where power efficiency is a major challenge. Key-Words OFDM, peak-factor, coding, Reed-Müller codes, soft decoding, nonlinear amplifiers.
منابع مشابه
Sufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms
In this paper, we consider sufficient conditions for ruling out some useless iteration steps in a class of softdecision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Sufficient conditions for ruling out the next single decoding step, called ruling-out conditions and those for ruling out all the subsequent iteration steps, called early term...
متن کاملMaximum-likelihood soft decision decoding of BCH codes
The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several identical codes. We show that the same kind of direct-sum structure exists in all the primitive BCH codes. as well as i...
متن کاملImproved decoding of Reed-Solomon and algebraic-geometry codes
Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes. The list decoding problem for Reed-Solomon codes reduces to the following “curve-fitting” probl...
متن کاملImproved Decoding of Reed-Solomon and Algebraic-Geometric Codes
Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes. The list decoding problem for Reed-Solomon codes reduces to the following “curve-fitting” probl...
متن کاملFull-parallel architecture for turbo decoding of product codes
A full-parallel architecture for turbo decoding, which achieves ultrahigh data rates when using product codes as error correcting codes, is proposed. This architecture is able to decode product codes using binary BCH or m-ary Reed-Solomon component codes. The major advantage of our architecture is that it enables the memory blocks between all half-iterations to be removed. Moreover, the latency...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002